SOLUTIONS OF THE DIOPHANTINE EQUATION xy+yz+zx=n!
نویسندگان
چکیده
منابع مشابه
On the Solutions to the Diophantine Equation
In this paper we are concerned with a question that has already been answered, involving Fibonacci-type sequences and their characteristic numbers. We are only interested in primitive sequences iconsecutive pairs of terms have no common factors) and for these sequences we ask: What numbers can be the characteristic of a sequence, and given such a number, how many sequences have it? Thoro [1] ha...
متن کاملThe Smallest Solutions to the Diophantine Equation
In this paper we discuss a method used to find the smallest nontrivial positive integer solutions to a1 + a 6 2 = b 6 1 + b 6 2 + b 6 3 + b 6 4 + b 6 5. The method, which is an improvement over a simple brute force approach, can be applied to search the solution to similar equations involving sixth, eighth and tenth powers.
متن کاملShort solutions for a linear Diophantine equation
It is known that finding the shortest solution for a linear Diophantine equation is a NP problem. In this paper we have devised a method, based upon the basis reduction algorithm, to obtain short solutions to a linear Diophantine equation. By this method we can obtain a short solution (not necessarily the shortest one) in a polynomial time. Numerical experiments show superiority to other method...
متن کاملOn the number of solutions of the Diophantine equation
1 Q (o) • (i)(l) 1 " *)• » (Z) (!) for any positive integers n, m9 and fc (<n). Apart from these cases, it is more difficult to decide whether there are infinitely many pairs of equal binomial coefficients or not. The problem of equal binomial coefficients was studies by several authors (e.g., Singmaster [6], [7]; Lind [4]; Abbot, Erdos, & Hanson [1]). Recently, in an article in this Quarterly,...
متن کاملOn Searching for Solutions of the Diophantine Equation
We propose a new search algorithm to solve the equation x3+y3 + z3 = n for a fixed value of n > 0. By parametrizing |x| =min(|x|, |y|, |z|), this algorithm obtains |y| and |z| (if they exist) by solving a quadratic equation derived from divisors of |x|3 ± n. By using several efficient number-theoretic sieves, the new algorithm is much faster on average than previous straightforward algorithms. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 2008
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089508004163